Choiceless Polynominal Time Logic: Inability to Express
نویسنده
چکیده
We prove for the logic ∼ CPT ime (the logic from the title) a sufficient condition for two models to be equivalent for any set of sentences which is “small” (certainly any finite set ), parallel to the Ehrenfeucht Fräıssé games. This enables us to show that sentences cannot express some properties in the logic ∼ CPT ime and prove 0-1 laws for it.
منابع مشابه
Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract)
We consider Choiceless Polynomial Time (C̃PT), a language introduced by Blass, Gurevich and Shelah, and show that it can express a query originally constructed by Cai, Fürer and Immerman to separate fixed-point logic with counting (IFP + C) from P. This settles a question posed by Blass et al. The program we present uses sets of unbounded finite rank: we demonstrate that this is necessary by sho...
متن کاملOn Polynomial Time Computation over Unordered Structures
This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a compl...
متن کاملIs Polynomial Time Choiceless?
A long time ago, Yuri Gurevich made precise the problem of whether there is a logic capturing polynomial-time on arbitrary finite structures, and conjectured that no such logic exists. This conjecture is still open. Nevertheless, together with Andreas Blass and Saharon Shelah, he has also proposed what still seems to be the most promising candidate for a logic for polynomial time, namely Choice...
متن کاملAddendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187
Addendum to “Choiceless polynomial time” Ann. Pure Appl. Logic 100 (1999) 141–187 Andreas Blassa ; ∗;1, Yuri Gurevichb Saharon Shelahc;d ; 2 aMathematics Department, University of Michigan, Ann Arbor, MI 48109–1109, USA bMicrosoft Research, One Microsoft Way, Redmond, WA 98052, USA cMathematics Department, Hebrew University, Jerusalem 91904, Israel dMathematics Department, Rutgers University, N...
متن کاملStrong extension axioms and Shelah's zero-one law for choiceless polynomial time
This paper developed from Shelah's proof of a zero-one law for the complexity class \choiceless polynomial time," de ned by Shelah and the authors. We present a detailed proof of Shelah's result for graphs, and describe the extent of its generalizability to other sorts of structures. The extension axioms, which form the basis for earlier zero-one laws (for rst-order logic, xed-point logic, and ...
متن کامل